Packing, Tiling, Orthogonality and Completeness

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Packing, Tiling, Ortho Preprint Gonality and Completeness

Let R d be an open set of measure 1. An open set D R d is called a tight orthogonal packing region for if D ? D does not intersect the zeros of the Fourier Transform of the indicator function of and D has measure 1. Suppose that is a discrete subset of R d. The main contribution of this paper is a new way of proving the folowing result (proved by Lagarias, Reeds and Wang and, in the case of bei...

متن کامل

Packing, tiling, and covering with tetrahedra.

It is well known that three-dimensional Euclidean space cannot be tiled by regular tetrahedra. But how well can we do? In this work, we give several constructions that may answer the various senses of this question. In so doing, we provide some solutions to packing, tiling, and covering problems of tetrahedra. Our results suggest that the regular tetrahedron may not be able to pack as densely a...

متن کامل

Using pattern matching for tiling and packing problems

This paper describes a new placement method based on pattern matching for 2D tiling problems. Tiling problem can be considered as a special case of bin packing. In the proposed method, the representation of the figures and the board is based on directional chain codes. Contrary to other works that the area has been used for the board and the figures, the proposed method is based on usage of the...

متن کامل

Efficient Approximation Algorithms for Tiling and Packing Problems with Rectangles

We provide improved approximation algorithms for several rectangle tiling and packing problems RTILE DRTILE and d RPACK studied in the literature Most of our algorithms are highly e cient since their running times are near linear in the sparse input size rather than in the domain size In addition we improve the best known approximation ratios

متن کامل

ar X iv : m at h / 99 04 06 6 v 1 [ m at h . C A ] 1 4 A pr 1 99 9 Packing , tiling , orthogonality and completeness

Let Ω ⊆ R be an open set of measure 1. An open set D ⊆ R is called a tight orthogonal packing region for Ω if D − D does not intersect the zeros of the Fourier Transform of the indicator function of Ω. Suppose that Λ is a discrete subset of R. The main contribution of this paper is a new way of proving the folowing result (proved by Lagarias, Reeds and Wang and, in the case of Ω being the cube,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bulletin of the London Mathematical Society

سال: 2000

ISSN: 0024-6093

DOI: 10.1112/s0024609300007281